Crossing and weighted crossing number of near-planar graphs

A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from different combinatorial viewpoints. On the one hand, we develop min-max formulas involving efficiently computable lower and upper bounds. These min-max results are the first of their kind in the study of crossing numbers and improve the approximation factor for the approximation algorithm given by Hliněny and Salazar (Graph Drawing GD’06). On the other hand, we show that it is NP-hard to compute a weighted version of the crossing number for near-planar graphs

Atomic Routing Games on Maximum Congestion

We study atomic routing congestion games in which each player chooses a path in the network from its strategy set (a collection of paths) with the objective to minimize the maximum congestion along any edge on its selected path. The social cost is the global maximum congestion on any edge in the network. We show that for arbitrary routing games, the price of stability is 1, and the price of anarchy, PoA, is bounded by κ − 1 ≤ PoA ≤ c(κ 2 + log 2 n), where κ is the length of the longest cycle in the network, n is the size of the network and c is a constant. Further, any best response dynamic converges to a Nash equilibrium. Our bounds show that for maximum congestion games, the topology of the network, in particular the length of cycles, plays an important role in determining the quality of the Nash equilibria. A fundamental issue in the management of large scale communication networks is to route the packet traffic so as to optimize the network performance. Our measure of network performance is the worst bottleneck (most used link) in the system. The model we use for network traffic is that of finite, unsplittable packets (atomic flow), and each packet’s path is controlled independentl

Bottleneck Routing Games with Low Price of Anarchy

We study {\em bottleneck routing games} where the social cost is determined by the worst congestion on any edge in the network. In the literature, bottleneck games assume player utility costs determined by the worst congested edge in their paths. However, the Nash equilibria of such games are inefficient since the price of anarchy can be very high and proportional to the size of the network. In order to obtain smaller price of anarchy we introduce {\em exponential bottleneck games} where the utility costs of the players are exponential functions of their congestions. We find that exponential bottleneck games are very efficient and give a poly-log bound on the price of anarchy: $O(\log L \cdot \log |E|)$, where $L$ is the largest path length in the players' strategy sets and $E$ is the set of edges in the graph. By adjusting the exponential utility costs with a logarithm we obtain games whose player costs are almost identical to those in regular bottleneck games, and at the same time have the good price of anarchy of exponential games.Comment: 12 page

Upward Three-Dimensional Grid Drawings of Graphs

A \emph{three-dimensional grid drawing} of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges do not cross. Our aim is to produce three-dimensional grid drawings with small bounding box volume. We prove that every $n$-vertex graph with bounded degeneracy has a three-dimensional grid drawing with $O(n^{3/2})$ volume. This is the broadest class of graphs admiting such drawings. A three-dimensional grid drawing of a directed graph is \emph{upward} if every arc points up in the z-direction. We prove that every directed acyclic graph has an upward three-dimensional grid drawing with $(n^3)$ volume, which is tight for the complete dag. The previous best upper bound was $O(n^4)$. Our main result is that every $c$-colourable directed acyclic graph ($c$ constant) has an upward three-dimensional grid drawing with $O(n^2)$ volume. This result matches the bound in the undirected case, and improves the best known bound from $O(n^3)$ for many classes of directed acyclic graphs, including planar, series parallel, and outerplanar

Faster Approximate String Matching for Short Patterns

We study the classical approximate string matching problem, that is, given strings $P$ and $Q$ and an error threshold $k$, find all ending positions of substrings of $Q$ whose edit distance to $P$ is at most $k$. Let $P$ and $Q$ have lengths $m$ and $n$, respectively. On a standard unit-cost word RAM with word size $w \geq \log n$ we present an algorithm using time $$O(nk \cdot \min(\frac{\log^2 m}{\log n},\frac{\log^2 m\log w}{w}) + n)$$ When $P$ is short, namely, $m = 2^{o(\sqrt{\log n})}$ or $m = 2^{o(\sqrt{w/\log w})}$ this improves the previously best known time bounds for the problem. The result is achieved using a novel implementation of the Landau-Vishkin algorithm based on tabulation and word-level parallelism.Comment: To appear in Theory of Computing System

Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth

We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollobas, and Sorkin (2004) and by Aigner and van der Holst (2004). We present an algorithm to evaluate the multivariate interlace polynomial of a graph with n vertices given a tree decomposition of the graph of width k. The best previously known result (Courcelle 2008) employs a general logical framework and leads to an algorithm with running time f(k)*n, where f(k) is doubly exponential in k. Analyzing the GF(2)-rank of adjacency matrices in the context of tree decompositions, we give a faster and more direct algorithm. Our algorithm uses 2^{3k^2+O(k)}*n arithmetic operations and can be efficiently implemented in parallel.Comment: v4: Minor error in Lemma 5.5 fixed, Section 6.6 added, minor improvements. 44 pages, 14 figure

Galactic vs. Extragalactic Origin of the Peculiar Transient SCP 06F6

We study four scenarios for the SCP 06F6 transient event that was announced recently. Some of these were previously briefly discussed as plausible models for SCP 06F6, in particular with the claimed detection of a z=0.143 cosmological redshift of a Swan spectrum of a carbon rich envelope. We adopt this value of z for extragalactic scenarios. We cannot rule out any of these models, but can rank them from most to least preferred. Our favorite model is a tidal disruption of a CO white dwarf (WD) by an intermediate-mass black hole (IMBH). To account for the properties of the SCP 06F6 event, we have to assume the presence of a strong disk wind that was not included in previous numerical simulations. If the IMBH is the central BH of a galaxy, this explains the non detection of a bright galaxy in the direction of SCP 06F6. Our second favorite scenario is a type Ia-like SN that exploded inside the dense wind of a carbon star. The carbon star is the donor star of the exploded WD. Our third favorite model is a Galactic source of an asteroid that collided with a WD. Such a scenario was discussed in the past as the source of dusty disks around WDs, but no predictions exist regarding the appearance of such an event. Our least favorite model is of a core collapse SN. The only way we can account for the properties of SCP 06F6 with a core collapse SN is if we assume the occurrence of a rare type of binary interaction.Comment: Accepted by New Astronom

Evolution of active and polar photospheric magnetic fields during the rise of Cycle 24 compared to previous cycles

The evolution of the photospheric magnetic field during the declining phase and minimum of Cycle 23 and the recent rise of Cycle 24 are compared with the behavior during previous cycles. We used longitudinal full-disk magnetograms from the NSO's three magnetographs at Kitt Peak, the Synoptic Optical Long-term Investigations of the Sun (SOLIS) Vector Spectro-Magnetograph (VSM), the Spectromagnetograph and the 512-Channel Magnetograph instruments, and longitudinal full-disk magnetograms from the Mt. Wilson 150-foot tower. We analyzed 37 years of observations from these two observatories that have been observing daily, weather permitting, since 1974, offering an opportunity to study the evolving relationship between the active region and polar fields in some detail over several solar cycles. It is found that the annual averages of a proxy for the active region poloidal magnetic field strength, the magnetic field strength of the high-latitude poleward streams, and the time derivative of the polar field strength are all well correlated in each hemisphere. These results are based on statistically significant cyclical patterns in the active region fields and are consistent with the Babcock-Leighton phenomenological model for the solar activity cycle. There was more hemispheric asymmetry in the activity level, as measured by total and maximum active region flux, during late Cycle 23 (after around 2004), when the southern hemisphere was more active, and Cycle 24 up to the present, when the northern hemisphere has been more active, than at any other time since 1974. The active region net proxy poloidal fields effectively disappeared in both hemispheres around 2004, and the polar fields did not become significantly stronger after this time. We see evidence that the process of Cycle 24 field reversal has begun at both poles.Comment: Accepted for publication in Solar Physic

Scatter Search for Graph Coloring

In this paper, we present a first scatter search approach for the Graph Coloring Problem (GCP). The evolutionary strategy scatter search operates on a set of configurations by combining two or more elements. New configurations are improved before replacing others according to their quality (fitness), and sometimes, to their diversity. Scatter search has been applied recently to some combinatorial optimization problems with promising results. Nevertheless, it seems that no attempt of scatter search has been published for the GCP. This paper presents such an investigation and reports experimental results on some wellstudied DIMACS graphs